Reformulations in Mathematical Programming: Symmetry
نویسنده
چکیده
If a mathematical program (be it linear or nonlinear) has many symmetric optima, solving it via Branch-and-Bound techniques often yields search trees of disproportionate sizes; thus, finding and exploiting symmetries is an important task. We propose a method for: (a) automatically finding the formulation group of any given Mixed-Integer Nonlinear Program, and (b) reformulating the problem so that some symmetric solutions become infeasible. The reformulated problem can then be solved via standard Branch-and-Bound codes such as CPLEX (for linear programs) and Couenne (for nonlinear programs). Our computational results include formulation group tables for the MIPLib3, MIPLib2003, GlobalLib and MINLPLib instance libraries, solution tables for some instances in the aforementioned libraries, and a theoretical and computational study of the symmetries of the Kissing Number Problem.
منابع مشابه
Applications of Reformulations in Mathematical Programming
Mathematical programming is a technique that can be used to solve real-world optimization problems, where one wants to maximize, or minimize, an objective function subject to some constraints on the decision variables. The key features of mathematical programming are the creation of a model for describing the problem (the so called formulation), and the implementation of efficient algorithms to...
متن کاملReformulations in Mathematical Programming: Definitions and Systematics
A reformulation of a mathematical program is a formulation which shares some properties with, but is in some sense better than, the original program. Reformulations are important with respect to the choice and efficiency of the solution algorithms; furthermore, it is desirable that reformulations can be carried out automatically. Reformulation techniques are very common in mathematical programm...
متن کاملReformulations in mathematical programming: automatic symmetry detection and exploitation
If a mathematical program has many symmetric optima, solving it via Branchand-Bound techniques often yields search trees of disproportionate sizes; thus, finding and exploiting symmetries is an important task. We propose a method for automatically finding the formulation group of any given Mixed-Integer Nonlinear Program, and for reformulating the problem by means of static symmetry breaking co...
متن کاملReformulations in Mathematical Programming: A Computational Approach
Mathematical programming is a language for describing optimization problems; it is based on parameters, decision variables, objective function(s) subject to various types of constraints. The present treatment is concerned with the case when objective(s) and constraints are algebraic mathematical expressions of the parameters and decision variables, and therefore excludes optimization of black-b...
متن کاملNew reformulations for stochastic nonlinear complementarity problems
We consider the stochastic nonlinear complementarity problem (SNCP). We first formulate the problem as a stochastic mathematical program with equilibrium constraints and then, in order to develop efficient algorithms, we give some reformulations of the problem. Furthermore, based on the reformulations, we propose a smoothed penalty method for solving SNCP. A rigorous convergence analysis is als...
متن کاملSolving Bilevel Mixed Integer Program by Reformulations and Decomposition
In this paper, we study bilevel mixed integer programming (MIP) problem and present a novel computing scheme based on reformulations and decomposition strategy. By converting bilevel MIP into a constrained mathematical program, we present its single-level reformulations that are friendly to perform analysis and build insights. Then, we develop a decomposition algorithm based on column-and-const...
متن کامل